Learning to Embed Sentences Using Attentive Recursive Trees
نویسندگان
چکیده
منابع مشابه
Learning Meanings for Sentences with Recursive Autoencoders
The objective of this project is to implement the recursive auto encoder (RAE) method to learn a model to predict sentiments for sentences and reproduce the result in [1]. To learn the weights for recursive functions, we implement forward and backward propagation algorithms. We validate the gradient computed from forward and backward algorithm by comparing it to the gradient computed from numer...
متن کاملLearning Meanings for Sentences with Recursive Autoencoders
In this report, we learn a model to predict sentiments for sentences by SemiSupervised Recursive Autoencoders (RAE) and reproduce the result in [1]. We use greedy algorithm to construct the tree structure in neural networks and forward and backward propagation to compute the gradients of weights. Using meaning vectors of length 20, we achieve 75.4% accuracy in the movie reviews (MR) dataset, wh...
متن کاملLearning Vector Representations for Sentences The Recursive Deep Learning Approach
The investigations were supported by the Faculty of Humanities of the University of Amsterdam, through a Digital Humanities fellowship. Faculteit der Geesteswetenschappen to my father who showed me the beauty of science and technology i Contents Acknowledgments vii 1 Introduction 1 1.
متن کاملSS-R: Semi-Supervised Recursive Learning Using Decision Trees
This paper presents a new method, called SS-R (Semi-Supervised Recursive Learning using Decision Trees), which creates a decision tree-based framework for autonomous classification and model updating using several independent algorithms. The method is tested on a multiclass data set, consisting of 11 different data classes. SS-R initially builds a classification tree using a well-known decision...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33016991